Flat output characterization for linear systems using polynomial matrices

نویسندگان

  • Jean Lévine
  • D. V. Nguyen
چکیده

This paper is devoted to the study of linear "at outputs for linear controllable time-invariant systems in polynomial matrix form. We characterize the transformations expressing the system variables in terms of a linear "at output and derivatives, called de#ning matrices, as the kernel of a polynomial matrix. An application to trajectory planning is presented, showing the usefulness of the present characterization. c © 2002 Elsevier Science B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Flatness for linear fractional systems with application to a thermal system

This paper is devoted to the study of the flatness property of linear time-invariant differential systems of fractional systems. We give two characterizations of fractionally flat outputs and algorithms to compute them. We then present an application to a two dimensional thermal system that we approximate by a fractional model of order 1 2 , that is fractionally flat. Trajectory planning of the...

متن کامل

A short overview of the electrical machines control based on Flatness-technique

Optimal linear controllers and high computational non-linear controllers are normally applied to control the nonlinear systems. Flatness control method is a control technique for linear systems as well as nonlinear systems by static and dynamic feedback namely as endogenous dynamic feedback. This method takes into account the non-linear behavior of the process while preventing complicated compu...

متن کامل

On higher rank numerical hulls of normal matrices

‎In this paper‎, ‎some algebraic and geometrical properties of the rank$-k$ numerical hulls of normal matrices are investigated‎. ‎A characterization of normal matrices whose rank$-1$ numerical hulls are equal to their numerical range is given‎. ‎Moreover‎, ‎using the extreme points of the numerical range‎, ‎the higher rank numerical hulls of matrices of the form $A_1 oplus i A_2$‎, ‎where $A_1...

متن کامل

Symbolic computation of the Duggal transform

Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...

متن کامل

Constructive computation of flat outputs of a class of multidimensional linear systems with variable coefficients

The purpose of this paper is to give a constructive algorithm for the computation of bases of finitely presented free modules over the Weyl algebras of differential operators with polynomial or rational coefficients. In particular, we show how to use these results in order to recognize when a multidimensional linear system defined by partial differential equations with polynomial or rational co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Systems & Control Letters

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2003